منابع مشابه
An Improved Quantum Scheduling Algorithm
The scheduling problem consists of finding a common 1 in two remotely located N bit strings. Denote the number of 1s in the string with the fewer 1s by N . Classically, it needs at least O( N log2 N) bits of communication to find the common 1. The best known quantum algorithm would require O( √ N log2 N) qubits of communication. This paper gives a quantum algorithm to find the common 1 with onl...
متن کاملAn Improved CPU Scheduling Algorithm
In multiprogramming systems i.e. in systems where several processes reside in memory, organization of processes is very important so that CPU always has one to execute. CPU scheduling is the base of multiprogramming operating systems. CPU executes one process at a time and switches between processes to improve CPU utilization. CPU scheduling strategies help in selecting the next process to be e...
متن کاملAn Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control and other fields where supervision personnel is working. The objective is to assign breaks to employees such that various constraints reflecting legal demands or ergonomic criteria are satisfied and staffing requiremen...
متن کاملAn improved parallel disk scheduling algorithm
We address the problems of prefetching and I/O scheduling for read-once reference strings in a parallel I/O system. Read-once reference strings, in which each block is accessed exactly once, arise naturally in applications like databases and video retrieval. Using the standard parallel disk model with D disks and a shared I/O buffer of size M , we present a novel algorithm, Red-Black Prefetchin...
متن کاملAn Improved WAGNER-WHITIN Algorithm
We present an improved implementation of the Wagner-Whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the Economic- Part-Period concept. The proposed method of this paper reduces the burden of the computations significantly in two different cases. We first assume there is no backlogging and inventory holding and set-up costs are fixed. The second model ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2003
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054103001984